Language generating alphabetic flat splicing P systems
نویسندگان
چکیده
منابع مشابه
Alphabetic Flat Splicing Pure Context-free Grammar Systems
In the context of DNA computing, an operation on words, called splicing, was introduced by Head (1987), in his study on recombinant behavior of DNA molecules. Recently, a special kind of splicing, called flat splicing on strings, was considered and several properties were derived. On the other hand, in the study of modelling of distributed complex systems based on language theory, grammar syste...
متن کاملFlat Splicing Array Grammar Systems Generating Picture Arrays
While studying the recombinant behaviour of DNA molecules, Head (1987) introduced a new operation, called splicing on words or strings, which are finite sequences of symbols. There has been intensive research using the concept of splicing on strings in the context of DNA computing, establishing important theoretical results on computational universality. A particular class of splicing, known as...
متن کاملSplicing Systems: Accepting Versus Generating
In this paper we propose a condition for rejecting the input word by an accepting splicing system which is defined by a finite set of forbidding words. More precisely, the input word is accepted as soon as a permitting word is obtained provided that no forbidding word has been obtained so far, otherwise it is rejected. Note that in the new variant of accepting splicing system the input word can...
متن کاملOn Derivation Languages of Flat Splicing Systems
In this work, we associate the idea of derivation languages with flat splicing systems and compare the languages generated as derivation languages (Szilard and Control languages) with the family of languages in Chomsky hierarchy. We show that there exist regular languages which cannot be generated as a Szilard language by any labeled flat splicing system. But some context-sensitive languages ca...
متن کاملWhen every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.12.014